f(empty, l) → l
f(cons(x, k), l) → g(k, l, cons(x, k))
g(a, b, c) → f(a, cons(b, c))
↳ QTRS
↳ DependencyPairsProof
f(empty, l) → l
f(cons(x, k), l) → g(k, l, cons(x, k))
g(a, b, c) → f(a, cons(b, c))
F(cons(x, k), l) → G(k, l, cons(x, k))
G(a, b, c) → F(a, cons(b, c))
f(empty, l) → l
f(cons(x, k), l) → g(k, l, cons(x, k))
g(a, b, c) → f(a, cons(b, c))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
F(cons(x, k), l) → G(k, l, cons(x, k))
G(a, b, c) → F(a, cons(b, c))
f(empty, l) → l
f(cons(x, k), l) → g(k, l, cons(x, k))
g(a, b, c) → f(a, cons(b, c))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
F(cons(x, k), l) → G(k, l, cons(x, k))
Used ordering: Polynomial interpretation [25,35]:
G(a, b, c) → F(a, cons(b, c))
The value of delta used in the strict ordering is 8.
POL(cons(x1, x2)) = 4 + (4)x_2
POL(G(x1, x2, x3)) = (3)x_1
POL(F(x1, x2)) = (2)x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
G(a, b, c) → F(a, cons(b, c))
f(empty, l) → l
f(cons(x, k), l) → g(k, l, cons(x, k))
g(a, b, c) → f(a, cons(b, c))